Stable Factorization of Strictly Hurwitz Polynomials
نویسندگان
چکیده
منابع مشابه
Hadamard Factorization of Hurwitz Stable Polynomials
The Hurwitz stable polynomials are important in the study of differential equations systems and control theory (see [7] and [19]). A property of these polynomials is related to Hadamard product. Consider two polynomials p, q ∈ R[x]: p(x) = anx n + an−1x n−1 + · · ·+ a1x + a0 q(x) = bmx m + bm−1x m−1 + · · ·+ b1x + b0 the Hadamard product (p ∗ q) is defined as (p ∗ q)(x) = akbkx + ak−1bk−1x + · ...
متن کاملLocal convex directions for Hurwitz stable polynomials
A new condition for a polynomial ( ) to be a local convex direction for a Hurwitz stable polynomial ( ) is derived. The condition is in terms of polynomials associated with the even and odd parts of ( ) and ( ), and constitutes a generalization of Rantzer’s phase-growth condition for global convex directions. It is used to determine convex directions for certain subsets of Hurwitz stable polyno...
متن کاملQuantitative Bounds for Hurwitz Stable Polynomials under Multiplier Transformations
We extend results of Borcea and Brändén to quantitatively bound the movement of the zeros of Hurwitz stable polynomials under linear multiplier operators. For a multiplier operator T on polynomials of degree up to n, we show that the ratio between the maximal real part of the zeros of a Hurwitz stable polynomial f and that of its transform T [f ] is minimized for the polynomial (z + 1). For T o...
متن کاملOn Robust Hurwitz Polynomials
In this note, Kharitonov's theorem on robust Hunvitz poljmomials is simplified for low-order polynomials. Specifically, for n = 3, 4, and 5, the number of polynomials required to check robust stability is one, two, and three, respectively, instead of four. Furthermore, it is shown that for n > 6, the number of polynomials for robust stability checking is necessarily four, thus further simplific...
متن کاملFactorization of Motion Polynomials
In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial factor and factorizations. The first algorithm is conceptually simpler but may require a high degree of the polynomial factor. The second algorithm gives an op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2010
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2010.5.2229